On Sets Defining Few Ordinary Lines

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sets Defining Few Ordinary Lines

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P . This confirms, for large n, a conjecture of Dirac and Motzkin. In fact we describe the exact extremisers for this problem, as well as all sets having fewer than n−C ordinary lines for some absolute const...

متن کامل

On Sets Defining Few Ordinary Circles

An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly three points of P. We show that if P is not contained in a line or a circle, then P spans at least [Formula: see text] ordinary circles. Moreover, we determine the exact minimum number of ordinary circles for all sufficiently large n and describe all point sets that come close to this minimum. We...

متن کامل

On Sets Defining Few Ordinary Planes

Let S be a set of n points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of S is less than Kn for some K = o(n 1 7 ) then, for n sufficiently large, all but at most O(K) points of S are contained in the intersection of two quadrics. Furthermore, we prove that there is a constant c such that if ...

متن کامل

Sets with few distinct distances do not have heavy lines

Let P be a set of n points in the plane that determines at most n/5 distinct distances. We show that no line can contain more than O(npolylog(n)) points of P . We also show a similar result for rectangular distances, equivalent to distances in the Minkowski plane, where the distance between a pair of points is the area of the axis-parallel rectangle that they span. The problem and its backgroun...

متن کامل

On the Number of Ordinary Lines Determined by Sets in Complex Space

Kelly’s theorem states that a set of n points affinely spanning C3 must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least 3n/2 ordinary lines, unless the configuration has n − 1 points in a plane and one point outside the plane (in which case there are at least n− 1 ordinary lines). In additi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2013

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-013-9518-9